Notes on Generative Probabilistic Bisimulation
نویسنده
چکیده
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we consider any process algebra giving rise to a Probabilistic Transition System satisfying the condition of regularity and offering prefixing, interleaving, and guarded recursion, then the coarsest congruence that is contained in weak bisimulation is strong bisimulation.
منابع مشابه
On Generative Parallel Composition
A major reason for studying probabilistic processes is to establish a link between a formal model for describing functional system behaviour and a stochastic process Compositionality is an essential ingredient for specifying systems Parallel compo sition in a probabilistic setting is complicated since it gives rise to non determinism for instance due to interleaving of independent autonomous ac...
متن کاملA Quantitative Approach to Noninterference for Probabilistic Systems
We present a technique for measuring the security of a system which relies on a probabilistic process algebraic formalisation of noninterference. We define a mathematical model for this technique which consists of a linear space of processes and linear transformations on them. In this model the measured quantity corresponds to the norm of a suitably defined linear operator associated to the sys...
متن کاملAxiomatizing Probabilistic Processes: ACP with Generative Probabilities
This paper is concerned with finding complete axiomatizations of probabilistic processes. We examine this problem within the context of the process algebra ACP and obtain as our end-result the axiom system prACPi, a probabilistic version of ACP which can be used to reason algebraically about the reliability and performance of concurrent systems. Our goal was to introduce probability into ACP in...
متن کاملOn Quantitative Analysis of Probabilistic Protocols
We advocate the use of approximate noninterference for the security analysis of probabilistic protocols. Our approach relies on a formalisation of the protocol in the setting of a probabilistic process algebra and a notion of process similarity based on weak probabilistic bisimulation. We illustrate this approach by presenting the analysis of a probabilistic nonrepudiation protocol which allows...
متن کاملReactive, Generative, and Stratified Models of Probabilistic Processes
12a. DISTRIBUTION / AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE 13. ABSTRACT (Maximum 200 words) We introduce three models of probabilistic processes, namely, reactive, generative and stratified. These models are investigated within the context of PCCS, an extension of Milner's SCCS in which each summand of a process summation expression is guarded by a probability and the sum of these probab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 175 شماره
صفحات -
تاریخ انتشار 2007